A combined approach for solution of general one-dimensional cutting stock problem

In this article, a combined method for the solution of the General one-Dimensional Cutting Stock Problem (G1D-CSP) is proposed. The main characteristic of G1D-CSP is that all stock lengths can be different. The new approach combines two existing methods: Sequential Heuristic Procedure, and branch-and-bound. The algorithm based on the proposed method leads to almost optimal solutions, which are substantially better than the solutions of known methods for the cost of slightly increased time complexity, which is still low. So, the new method is suitable for all sizes of the problem. Comparison with the Sequential Heuristic Procedure is presented.